Some theorems on multiplicative orders modulo p on average
نویسندگان
چکیده
منابع مشابه
AVERAGE RESULTS ON THE ORDER OF a MODULO p
Let a > 1 be an integer. Denote by la(p) the multiplicative order of a modulo primes p. We prove that if x log x log log x = o(y), then 1 y ∑ a≤y ∑ p≤x 1 la(p) = log x+ C log log x+O(1) +O ( x y log log x ) , which is an improvement over a theorem by Felix [Fe]. Additionally, we also prove two other related average results.
متن کاملon some bayesian statistical models in actuarial science with emphasis on claim count
چکیده ندارد.
15 صفحه اولAlmost Prime Orders of CM Elliptic Curves Modulo p
Let E/Q be an elliptic curve over the rationals and, for any prime p, let us denote by |E(Fp)| the number of Fp points of the reduced curve modulo p. Consider the function ΠE,s(x) = #{p ≤ x : |E(Fp)| = Ps}, where Ps denotes a squarefree number with at most s prime divisors. In particular P1 denotes a prime number. In 1988 Koblitz, motivated by criptographic applications, (see [1]), conjectured ...
متن کاملON THE ORDER OF a MODULO n, ON AVERAGE
Let a > 1 be an integer. Denote by la(n) the multiplicative order of a modulo integer n ≥ 1. We prove that there is a positive constant δ such that if x1−δ = o(y), then 1 y ∑
متن کاملOn the Average Case Complexity of Some P-complete Problems
We show that some classical P-complete problems can be solved efficiently in average NC. The probabilistic model we consider is the sample space of input descriptions of the problem with the underlying distribution being the uniform one. We present parallel algorithms that use a polynomial number of processors and have expected time upper bounded by (eIn4 + o(l))logn, asymptotically with high p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2020
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2019.07.024